TSTP Solution File: SWV429^1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWV429^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.KoUpFaIzHV true

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep  1 00:09:54 EDT 2023

% Result   : Theorem 0.21s 0.75s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   39 (  27 unt;  10 typ;   0 def)
%            Number of atoms       :   78 (  24 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   65 (   5   ~;   3   |;   0   &;  52   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   73 (  73   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  10 usr;   3 con; 0-3 aty)
%                                         (   2  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   57 (  47   ^;  10   !;   0   ?;  57   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mor_type,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(mnot_type,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(rel_type,type,
    rel: $i > $i > $o ).

thf(mimpl_type,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(icl_impl_princ_type,type,
    icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(icl_princ_type,type,
    icl_princ: ( $i > $o ) > $i > $o ).

thf(a_type,type,
    a: $i > $o ).

thf(mvalid_type,type,
    mvalid: ( $i > $o ) > $o ).

thf(iclval_type,type,
    iclval: ( $i > $o ) > $o ).

thf(mbox_type,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(icl_impl_princ,axiom,
    ( icl_impl_princ
    = ( ^ [A: $i > $o,B: $i > $o] : ( mbox @ rel @ ( mimpl @ A @ B ) ) ) ) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ! [Y: $i] :
          ( ( R @ X @ Y )
         => ( P @ Y ) ) ) ) ).

thf('0',plain,
    ( mbox
    = ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
        ! [Y: $i] :
          ( ( R @ X @ Y )
         => ( P @ Y ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mbox]) ).

thf('1',plain,
    ( mbox
    = ( ^ [V_1: $i > $i > $o,V_2: $i > $o,V_3: $i] :
        ! [X4: $i] :
          ( ( V_1 @ V_3 @ X4 )
         => ( V_2 @ X4 ) ) ) ),
    define([status(thm)]) ).

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ) ).

thf('2',plain,
    ( mor
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mor]) ).

thf('3',plain,
    ( mor
    = ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
          ( ( V_1 @ V_3 )
          | ( V_2 @ V_3 ) ) ) ),
    define([status(thm)]) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X: $i > $o,U: $i] :
          ~ ( X @ U ) ) ) ).

thf('4',plain,
    ( mnot
    = ( ^ [X: $i > $o,U: $i] :
          ~ ( X @ U ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mnot]) ).

thf('5',plain,
    ( mnot
    = ( ^ [V_1: $i > $o,V_2: $i] :
          ~ ( V_1 @ V_2 ) ) ),
    define([status(thm)]) ).

thf('6',plain,
    ( mimpl
    = ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mimpl,'3','5']) ).

thf('7',plain,
    ( mimpl
    = ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mor @ ( mnot @ V_1 ) @ V_2 ) ) ),
    define([status(thm)]) ).

thf('8',plain,
    ( icl_impl_princ
    = ( ^ [A: $i > $o,B: $i > $o] : ( mbox @ rel @ ( mimpl @ A @ B ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[icl_impl_princ,'1','7','3','5']) ).

thf('9',plain,
    ( icl_impl_princ
    = ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mbox @ rel @ ( mimpl @ V_1 @ V_2 ) ) ) ),
    define([status(thm)]) ).

thf(icl_s4_valid,axiom,
    ( iclval
    = ( ^ [X: $i > $o] : ( mvalid @ X ) ) ) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [P: $i > $o] :
        ! [W: $i] : ( P @ W ) ) ) ).

thf('10',plain,
    ( mvalid
    = ( ^ [P: $i > $o] :
        ! [W: $i] : ( P @ W ) ) ),
    inference(simplify_rw_rule,[status(thm)],[mvalid]) ).

thf('11',plain,
    ( mvalid
    = ( ^ [V_1: $i > $o] :
        ! [X4: $i] : ( V_1 @ X4 ) ) ),
    define([status(thm)]) ).

thf('12',plain,
    ( iclval
    = ( ^ [X: $i > $o] : ( mvalid @ X ) ) ),
    inference(simplify_rw_rule,[status(thm)],[icl_s4_valid,'11']) ).

thf('13',plain,
    ( iclval
    = ( ^ [V_1: $i > $o] : ( mvalid @ V_1 ) ) ),
    define([status(thm)]) ).

thf(icl_princ,axiom,
    ( icl_princ
    = ( ^ [P: $i > $o] : P ) ) ).

thf('14',plain,
    ( icl_princ
    = ( ^ [P: $i > $o] : P ) ),
    inference(simplify_rw_rule,[status(thm)],[icl_princ]) ).

thf('15',plain,
    ( icl_princ
    = ( ^ [V_1: $i > $o] : V_1 ) ),
    define([status(thm)]) ).

thf(conj,conjecture,
    iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i,X6: $i] : $true ).

thf(zf_stmt_1,negated_conjecture,
    ~ ! [X4: $i,X6: $i] : $true,
    inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl0,plain,
    ~ ( !!
      @ ^ [Y0: $i] :
          ( !!
          @ ^ [Y1: $i] : $true ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl1,plain,
    $false,
    inference('simplify boolean subterms',[status(thm)],[zip_derived_cl0]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV429^1 : TPTP v8.1.2. Released v3.6.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.KoUpFaIzHV true
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Aug 29 06:33:50 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Running portfolio for 300 s
% 0.13/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  % Number of cores: 8
% 0.13/0.36  % Python version: Python 3.6.8
% 0.13/0.36  % Running in HO mode
% 0.21/0.67  % Total configuration time : 828
% 0.21/0.67  % Estimated wc time : 1656
% 0.21/0.67  % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.72  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.72  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.21/0.72  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.21/0.74  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.21/0.75  % Solved by lams/35_full_unif4.sh.
% 0.21/0.75  % done 0 iterations in 0.010s
% 0.21/0.75  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.21/0.75  % SZS output start Refutation
% See solution above
% 0.21/0.75  
% 0.21/0.75  
% 0.21/0.75  % Terminating...
% 0.21/0.86  % Runner terminated.
% 0.21/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------